Manufacturing Production Line Modelling and Classification of Associated NP-Hard Problems
نویسندگان
چکیده
منابع مشابه
Lecture 29: Np-hard Problems [fa'12] 29 Np-hard Problems 29.1 'efficient' Problems
A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1 Researchers recognized early on that not all problems can be solved this quickly, but we had a hard time figuring out exactly which ones could and which ones couldn’t. there are several so-called NP-hard prob...
متن کاملLecture 21: Np-hard Problems 21 Np-hard Problems 21.1 'efficient' Problems
A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1 Researchers recognized early on that not all problems can be solved this quickly, but we had a hard time figuring out exactly which ones could and which ones couldn’t. there are several so-called NP-hard prob...
متن کاملNP-Hard Triangle Packing Problems
In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...
متن کاملNP-Hard Module Rotation Problems
Preplaced circuit modules may be rotated to improve performance and/or routability. We show that several simple versions of the module rotation problem are NP-hard.
متن کاملNP-Hard Network Upgrading Problems+
University of Florida Technical Report 91-29 Abstract Graphs with delays associated with their edges are often used to model communication and signal flow networks. Network performance can be improved by upgrading the network vertices. Such an improvement reduces the edge delays and comes at a cost. We study different formulations of this network performance improvement problem and show that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer & Software Engineering
سال: 2018
ISSN: 2456-4451
DOI: 10.15344/2456-4451/2018/128